package com.codechen.leetcode.tree;


import com.codechen.leetcode.utils.TreeNode;

/*110. 平衡二叉树
 */
public class Question110 {



    public boolean isBalanced(TreeNode root) {
        if (root == null){
            return  true;
        }

        return Math.abs(height(root.left) - height(root.right)) <= 1 && isBalanced(root.left) && isBalanced(root.right);
    }

    private int height(TreeNode root) {
        if (root == null) {
            return 0;
        } else {
            return Math.max(height(root.left), height(root.right)) + 1;
        }

    }



}
